Intelligent query open another door to 3d object retrieval.

Cast2Face character identification in movie with actor%2Dcharacter correspondence.

Weakly%2Dsupervised hashing in kernel space.

Dual Phase Learning for Large Scale Video Gait Recognition.

Large Scale Rich Media Information Search Challenges and Opportunities.

Effective music tagging through advanced statistical modeling.

Privacy%2Dpreserving similarity%2Dbased text retrieval.

Does sampling influence customers in online retailing of digital music%3F

Exploiting Intensity Inhomogeneity to Extract Textured Objects from Natural Scenes.



CompositeMap a novel music similarity measure for personalized multimodal music search.
How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems in music information retrieval. This paper demonstrates a novel multimodal and adaptive music similarity measure (CompositeMap) with its application in a personalized multimodal music search system. CompositeMap can effectively combine music properties from different aspects into compact signatures via supervised learning, which lays the foundation for effective and efficient music search. In addition, an incremental Locality Sensitive Hashing algorithm is developed to support more efficient search processes. Experimental results based on two large music collections reveal various advantages in effectiveness, efficiency, adaptiveness, and scalability of the proposed music similarity measure and the music search system. Categories and Subject Descriptors
CompositeMap a novel framework for music similarity measure.
With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effective technique for organizing, browsing, and searching large data collections, music information retrieval is attracting more and more attention. How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems. In this paper, we introduce a novel framework based on a multimodal and adaptive similarity measure for various applications. Distinguished from previous approaches, our system can effectively combine music properties from different aspects into a compact signature via supervised learning. In addition, an incremental Locality Sensitive Hashing algorithm has been developed to support efficient retrieval processes with different kinds of queries. Experimental results based on two large music collections reveal various advantages of the proposed framework including effectiveness, efficiency, adaptiveness, and scalability. Categories and Subject Descriptors
Robust Semantic Concept Detection in Large Video Collections.

Linear Regression.

Log%2DLinear Regression.

A novel framework for efficient automated singer identification in large music databases.

Stochastic modeling western paintings for effective classification.

Visual information analysis for security.

Distribution%2Dbased similarity measures for multi%2Ddimensional point set retrieval applications.

Bayesian tensor analysis.


Effective video event detection via subspace projection.


How to influence my customers%3F the impact of electronic market design.

Bayesian Tensor Approach for 3%2DD Face Modeling.

Modality Mixture Projections for Semantic Video Event Detection.

QueST querying music databases by acoustic and textual features.



An Empirical Study of Query Effectiveness Improvement via Multiple Visual Feature Integration.

Exploring composite acoustic features for efficient music similarity query.

Efficient benchmarking of content%2Dbased image retrieval via resampling.

Efficient benchmarking of content%2Dbased image retrieval via resampling.

An Agent%2DBased Approach for Cooperative Data Management.

HSI A Novel Framework for Efficient Automated Singer Identification in Large Music Database.

Towards efficient automated singer identification in large music databases.

InMAF indexing music databases via multiple acoustic features.

Towards Effective Content%2DBased Music Retrieval With Multiple Acoustic Feature Combination.

Exploring Bit%2DDifference for Approximate KNN Search in High%2Ddimensional Databases.
In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two points contributes a dominant portion of the overall query response time for memory processing. To reduce the distance computation, we first propose a structure (BID) using BIt-Difference to answer approximate KNN query. The BID employs one bit to represent each feature vector of point and the number of bit-difference is used to prune the further points. To facilitate real dataset which is typically skewed, we enhance the BID mechanism with clustering, cluster adapted bitcoder and dimensional weight, named the BID+. Extensive experiments are conducted to show that our proposed method yields significant performance advantages over the existing index structures on both real life and synthetic high-dimensional datasets.
On Efficient Music Genre Classification.

On Effective E%2Dmail Classification via Neural Networks.

Semantic%2DSensitive Classification for Large Image Libraries.

Improving Query Effectiveness for Large Image Databases with Multiple Visual Feature Combination.

Integrating heterogeneous reatures for efficient content based music retrieval.

Improving Query Effectiveness for Large Image Databases with Multiple Visual Feature Combination.

CMVF A Novel Dimension Reduction Scheme for Efficient Indexing in A Large Image Database.
INTRODUCTION In recent years, due to the increasing volumes of multimedia data in the World Wide Web, digital library, biomedicine and other applications, efficient content based similarity search in large image databases is gaining considerable research attentions. As a result, various indexing methods known as Spatial Access Methods (SAMs) and metric trees have been proposed to support this kind of retrieval. The former includes SS-tree, R + -tree and grid files;the latter includes the vp-tree, mvp-tree , GNAT and M-tree [3]. However, the optimised distance-based access methods currently available for multidimensional indexing in multimedia databases are developed based on two major assumptions: a suitable distance function is known a priori and the dimensionality of the image features is low. Unfortunately, these assumptions do not make the problem substantially easier to solve. For example, it is extremely difficult to define a distance function that accurately mimics human vi
